Nicolaas Govert de Bruijn (1918–2012) Mathematician, computer scientist, logician

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Rth Smallest Part Size of a Random Integer Partition

We study the size of the rth smallest part and the rth smallest distinct part in a random integer partition. This extends the research on partitions with no small parts of Nicolas and Sárközy. – To the memory of Nicolaas Govert (Dick) de Bruijn

متن کامل

De Bruijn Graph Homomorphisms and Recursive De Bruijn Sequences

This paper presents a method to find new de Bruijn cycles based on ones of lesser order. This is done by mapping a de Bruijn cycle to several vertex disjoint cycles in a de Bruijn digraph of higher order and connecting these cycles into one full cycle. We characterize homomorphisms between de Bruijn digraphs of different orders that allow this construction. These maps generalize the well-known ...

متن کامل

De Bruijn Sequences Revisited

A (non-circular) de Bruijn sequence w of order n is a word such that every word of length n appears exactly once in w as a factor. In this paper, we generalize the concept to different settings: the multi-shift de Bruijn sequence and the pseudo de Bruijn sequence. An m-shift de Bruijn sequence of order n is a word such that every word of length n appears exactly once in w as a factor that start...

متن کامل

Generalized de Bruijn Cycles

For a set of integers I, we define a q-ary I-cycle to be an assignment of the symbols 1 through q to the integers modulo qn so that every word appears on some translate of I. This definition generalizes that of de Bruijn cycles, and opens up a multitude of questions. We address the existence of such cycles, discuss “reduced” cycles (ones in which the all-zeroes string need not appear), and prov...

متن کامل

The De Bruijn Factor

We study de Bruijn’s ‘loss factor’ between the size of an ordinary mathematical exposition and its full formal translation inside a computer. This factor is determined by a combination of the amount of detail present in the original text and the expressivity of the system used to do the formalization. For three specific examples this factor turns out to be approximately equal to four.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Indagationes Mathematicae

سال: 2013

ISSN: 0019-3577

DOI: 10.1016/j.indag.2013.09.004